Realizability of high-level message sequence charts: closing the gaps

Safe Realizability of High-Level Message Sequence Charts

Realizability of Dynamic MSC Languages

We introduce dynamic communicating automata (DCA), an extension of communicating finite-state machines that allows for dynamic creation of processes. Their behavior can be described as sets of message sequence charts (MSCs). We consider the realizability problem for DCA: given a dynamic MSC grammar (a high-level MSC specification), is there a DCA defining the same set of MSCs? We show that this...

Scenario Realizability with Constraint Optimization

This work considers implementation of requirements expressed as High-level Message Sequence Charts (HMSCs). All HMSCs are not implementable, but a particular subclass called local HMSCs can be implemented using a simple projection operation. This paper proposes a new technique to transform an arbitrary HMSC specification into a local HMSC, hence allowing implementation. We show that this transf...

High-level message sequence charts

We study High-level Message Sequence Charts – a concept incorporated into MSC96 for composing MSCs explicitly. A formal semantics is given which extends the accepted process algebra semantics of MSC92. We assess the language by studying a simple example, which leads us to consider the extension of HMSC with gates.

Anchored Concatenation of MSCs

We study collections of Message Sequence Charts (MSCs) defined by High-level MSCs (HMSCs) under a new type of concatenation operation called anchored concatenation. We show that there is no decision procedure for determining if the MSC language defined by an HMSC is regular and that it is undecidable if an HMSC admits an implied scenario. Further, the languages defined by locally synchronized H...